Time-Free Solution to Hamilton Path Problems Using P Systems withd-Division

Linear Time Solution to Prime Factorization by Tissue P Systems with Cell Division

Prime factorization is useful and crucial for public-key cryptography, and its application in public-key cryptography is possible only because prime factorization has been presumed to be difficult. A polynomial-time algorithm for prime factorization on a quantum computer was given by P. W. Shor in 1997. In this work, it is considered as a function problem, and in the framework of tissue P syste...

Solving Subset Sum Problems by Time-free Spiking Neural P Systems

In membrane computing, spiking neural P systems (shortly called SN P systems) are a group of neural-like computing models inspired from the way spiking neurons communication in form of spikes. In previous works, SN P systems working in a nondeterministic manner have been used to solve numerical NP-complete problems, such as SAT, vertex cover, in feasible time. In these works, the application of...

Running Time Analysis of ACO Systems for Shortest Path Problems

Ant Colony Optimization (ACO) is inspired by the ability of ant colonies to find shortest paths between their nest and a food source. We analyze the running time of different ACO systems for shortest path problems. First, we improve running time bounds by Attiratanasunthron and Fakcharoenphol [Information Processing Letters, 105(3):88–92, 2008] for single-destination shortest paths and extend t...

A Polynomial Time Algorithm for Hamilton Cycle (Path)

This research develops a polynomial time algorithm for Hamilton Cycle(Path) and proves its correctness. A program is developed according to this algorithm and it works very well. This paper declares the research process, algorithm as well as its proof, and the experiment data. Even only the experiment data is a breakthrough.

Priority Setting on the Path to UHC: Time for Stronger Institutions and Stronger Health Systems: Response to Recent Commentaries